منابع مشابه
Locally Decodable Codes
Locally decodable codes are a class of error-correcting codes. Errorcorrecting codes help ensure reliable transmission of information over noisy channels. Such codes allow one to add redundancy, or bit strings, to messages, encoding them into longer bit strings, called codewords, in a way that the message can still be recovered even if a certain fraction of the codeword bits are corrupted. In t...
متن کاملLocally Decodable Quantum Codes
We study a quantum analogue of locally decodable error-correcting codes. A q-query locally decodable quantum code encodes n classical bits in an m-qubit state, in such a way that each of the encoded bits can be recovered with high probability by a measurement on at most q qubits of the quantum code, even if a constant fraction of its qubits have been corrupted adversarially. We show that such a...
متن کاملLocally decodable codes
Locally decodable codes (LDCs) are error correcting codes that simultaneously provide efficient random-access to encoded data and high noise resilience by allowing reliable reconstruction of an arbitrary data bit from looking at only a small number of randomly chosen codeword bits. In this work we survey three known families of LDCs and compare their parameters.
متن کاملPrivate Locally Decodable Codes
We consider the problem of constructing efficient locally decodable codes in the presence of a computationally bounded adversary. Assuming the existence of one-way functions, we construct efficient locally decodable codes with positive information rate and low (almost optimal) query complexity which can correctly decode any given bit of the message from constant channel error rate ρ. This compa...
متن کاملQuery-Efficient Locally Decodable Codes
A k-query locally decodable code (LDC) C : Σn → ΓN encodes each message x into a codeword C(x) such that each symbol of x can be probabilistically recovered by querying only k coordinates of C(x), even after a constant fraction of the coordinates have been corrupted. Yekhanin (2008) constructed a 3-query LDC of subexponential length, N = exp(exp(O(log n/ log log n))), under the assumption that ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2016
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2016.2526655